The Global Problem of Time
نویسنده
چکیده
Time does not obviously appear amongst the coordinates on the constrained phase space of general relativity in the Hamiltonian formulation. Recent work in finite-dimensional models claims that topological obstructions generically make the global definition of time impossible. It is shown here that a time coordinate can be globally defined on a constrained phase space by patching together local time coordinates, just as coordinates are defined on topologically non-trivial manifolds.
منابع مشابه
Using Modified IPSO-SQP Algorithm to Solve Nonlinear Time Optimal Bang-Bang Control Problem
In this paper, an intelligent-gradient based algorithm is proposed to solve time optimal bang-bang control problem. The proposed algorithm is a combination of an intelligent algorithm called improved particle swarm optimization algorithm (IPSO) in the first stage of optimization process together with a gradient-based algorithm called successive quadratic programming method (SQP) in the second s...
متن کاملGlobal attractor for a nonlocal hyperbolic problem on ${mathcal{R}}^{N}$
We consider the quasilinear Kirchhoff's problem$$ u_{tt}-phi (x)||nabla u(t)||^{2}Delta u+f(u)=0 ,;; x in {mathcal{R}}^{N}, ;; t geq 0,$$with the initial conditions $ u(x,0) = u_0 (x)$ and $u_t(x,0) = u_1 (x)$, in the case where $N geq 3, ; f(u)=|u|^{a}u$ and $(phi (x))^{-1} in L^{N/2}({mathcal{R}}^{N})cap L^{infty}({mathcal{R}}^{N} )$ is a positive function. The purpose of our work is to ...
متن کاملExistence and blow-up of solution of Cauchy problem for the sixth order damped Boussinesq equation
In this paper, we consider the existence and uniqueness of the global solution for the sixth-order damped Boussinesq equation. Moreover, the finite-time blow-up of the solution for the equation is investigated by the concavity method.
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملStudy of buffer effects on the grouping efficacy measure of stochastic cell formation problem
This paper deals the stochastic cell formation problem (SCFP). The paper presents a new nonlinear integer programming model for the SCFP in which the effect of buffer size on the grouping efficacy of cells has been investigated. The objective function is the maximization of the grouping efficacy of cells. A chance constraint is applied to explore the effect of buffer on the SCFP. Processing tim...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992